منابع مشابه
Secure Network Coding over Small Fields
In the paradigm of network coding, the information-theoretic security problem is encountered in the presence of a wiretapper, who has capability of accessing an unknown channel-subset in communication networks. In order to combat this eavesdropping attack, secure network coding is introduced to prevent information from being leaked to adversaries. For any construction of secure linear network c...
متن کاملEnergy and field size dependence of a silicon diode designed for small-field dosimetry
Purpose: To investigate the energy dependence/spectral sensitivity of silicon diodes designed for small-field dosimetry and obtain response factors (RFs) for arbitrary photon spectra using Monte Carlo (MC) simulations. Methods: The EGSnrc user-code DOSRZnrc was used to calculate the dose deposition in water and in the active volume of a stereotactic diode f...
متن کاملWeakly Secure Network Coding
In this work we consider the problem of secure data transmission on an acyclic multicast network. A new information theoretic model for security is proposed that defines the system as secure if an eavesdropper is unable to get any “meaningful” information about the source. The “wiretap” network model by Cai and Yeung in which no information of the source is made available to the eavesdropper is...
متن کاملSecure Network Coding for a P2P System
Network coding is a data transmission technique which allows intermediate nodes in a network to re-code data in transit. In contrast to traditional network communication where a node repeats incoming data to its outgoing channel without modifying the payload, a node implementing network coding not only repeats but also alters data. Network coding has been demonstrated to increase network throug...
متن کاملOn Field Size and Success Probability in Network Coding
Using tools from algebraic geometry and Gröbner basis theory we solve two problems in network coding. First we present a method to determine the smallest field size for which linear network coding is feasible. Second we derive improved estimates on the success probability of random linear network coding. These estimates take into account which monomials occur in the support of the determinant o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2015
ISSN: 1089-7798
DOI: 10.1109/lcomm.2014.2385053